package com.dl.leetcode;

import com.dl.leetcode.util.ListNode;

/**
 * @author DL
 * @create 2023-06-08 10:16
 */
public class LeetCode230608 {

    /**
     * 合并两个有序链表
     *
     * @param list1 list1
     * @param list2 list2
     * @return {@link ListNode }
     * @author DL
     * @date 2023/06/14
     */
    public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
        while (list1.getNext().getVal() != 0){
            while (list2.getNext().getVal() != 0){
                int val1 = list1.getVal();
            }
        }
        return null;
    }

    /*public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode result = new ListNode();
        ListNode current = result;
        while(l1!=null&&l2!=null)
        {
            if(l1.val<=l2.val){
                current.next = l1;
                l1 = l1.next;
            }
            else if(l1.val>l2.val){
                current.next = l2;
                l2 = l2.next;
            }
            current = current.next;
        }
        if(l1==null){
            current.next=l2;
        }
        if(l2==null){
            current.next=l1;
        }
        return result.next;
    }*/


}
